Microarray data clustering based on temporal variation: FCV with TSD preclustering.

نویسندگان

  • Carla S Möller-Levet
  • Kwang-Hyun Cho
  • Olaf Wolkenhauer
چکیده

The aim of this paper is to present a new clustering algorithm for short time-series gene expression data that is able to characterise temporal relations in the clustering environment (ie data-space), which is not achieved by other conventional clustering algorithms such as k -means or hierarchical clustering. The algorithm called fuzzy c -varieties clustering with transitional state discrimination preclustering (FCV-TSD) is a two-step approach which identifies groups of points ordered in a line configuration in particular locations and orientations of the data-space that correspond to similar expressions in the time domain. We present the validation of the algorithm with both artificial and real experimental datasets, where k -means and random clustering are used for comparison. The performance was evaluated with a measure for internal cluster correlation and the geometrical properties of the clusters, showing that the FCV-TSD algorithm had better performance than the k -means algorithm on both datasets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DNA Microarray Data Clustering Based on Temporal Variation: FCV with TSD Preclustering

The aim of this paper is to present a new clustering algorithm for short time-series gene expression data that is able to characterize temporal relations in the clustering environment (i.e., data-space), which is not achieved by other conventional clustering algorithms such as k-means or hierarchical clustering. The algorithm called fuzzy cvarieties clustering with Transitional State Discrimina...

متن کامل

Clustering huge data sets for parametric PET imaging.

A new preprocessing clustering technique for quantification of kinetic PET data is presented. A two-stage clustering process, which combines a precluster and a classic hierarchical cluster analysis, provides data which are clustered according to a distance measure between time activity curves (TACs). The resulting clustered mean TACs can be used directly for estimation of kinetic parameters at ...

متن کامل

Modification of the Fast Global K-means Using a Fuzzy Relation with Application in Microarray Data Analysis

Recognizing genes with distinctive expression levels can help in prevention, diagnosis and treatment of the diseases at the genomic level. In this paper, fast Global k-means (fast GKM) is developed for clustering the gene expression datasets. Fast GKM is a significant improvement of the k-means clustering method. It is an incremental clustering method which starts with one cluster. Iteratively ...

متن کامل

Iterative Clustering Algorithm for Analyzing Temporal Patterns of Gene Expression

Microarray experiments are information rich; however, extensive data mining is required to identify the patterns that characterize the underlying mechanisms of action. For biologists, a key aim when analyzing microarray data is to group genes based on the temporal patterns of their expression levels. In this paper, we used an iterative clustering method to find temporal patterns of gene express...

متن کامل

A New Clustering Segmentation Algorithm of 3D Medical Data Field Based on Data Mining

Direct 3D volume segmentation is one of the difficult and hot research fields in 3D medical data field processing. Using the clustering and analyzing techniques of data mining, a new clustering and segmentation algorithm for 3D medical image based on density-isoline is presented. Firstly, According to the physical means of the medical data, the voxel’s gray level value in data field is redefine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied bioinformatics

دوره 2 1  شماره 

صفحات  -

تاریخ انتشار 2003